Orthogonal matrix polynomials and applications
نویسندگان
چکیده
منابع مشابه
On Orthogonal Matrix Polynomials
In this paper we deal with orthogonal matrix polynomials. First of all, we establish some basic notations and results we need later. A matrix polynomial P is a matrix whose entries are polynomials, or, equivalently, a combination P(t) = A 0 +A 1 t+ +A n t n , where A 0 ; ; A n are numerical matrices (the size of all the matrices which appear in this paper is N N). A positive deenite matrix of m...
متن کاملOrthogonal polynomials: applications and computation
We give examples of problem areas in interpolation, approximation, and quadrature, that call for orthogonal polynomials not of the classical kind. We then discuss numerical methods of computing the respective Gauss-type quadrature rules and orthogonal polynomials. The basic task is to compute the coefficients in the three-term recurrence relation for the orthogonal polynomials. This can be done...
متن کامل2 Rectangular Matrix Orthogonal Polynomials
Classical orthogonal polynomials and matrix polynomials being orthogonal with respect to some Hermitean positive deenite matrix of measures share several properties , e.g., three term recurrencies, Christooel{Darboux formulas; there are connections to the triangular decomposition of the (inverse) moment matrix and to eigenvalue{problems for the banded matrix of recurrence coeecients. Also, a co...
متن کاملThe Matrix Ansatz, Orthogonal Polynomials, and Permutations
In this paper we outline a Matrix Ansatz approach to some problems of combinatorial enumeration. The idea is that many interesting quantities can be expressed in terms of products of matrices, where the matrices obey certain relations. We illustrate this approach with applications to moments of orthogonal polynomials, permutations, signed permutations, and tableaux. To Dennis Stanton with admir...
متن کاملRandom block matrices and matrix orthogonal polynomials
In this paper we consider random block matrices, which generalize the general beta ensembles, which were recently investigated by Dumitriu and Edelmann (2002, 2005). We demonstrate that the eigenvalues of these random matrices can be uniformly approximated by roots of matrix orthogonal polynomials which were investigated independently from the random matrix literature. As a consequence we deriv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1996
ISSN: 0377-0427
DOI: 10.1016/0377-0427(95)00193-x